/**
 * NetworkADT defines the interface to a network.
 *
 * @author Dr. Lewis
 * @author Dr. Chase
 * @version 1.0, 9/17/2008
 */

package org.eda.actividad4;
import java.util.Iterator;

public interface NetworkADT<T> extends GraphADT<T>
{
   /** 
    * Inserts an edge between two vertices of this graph. 
    *
    * @param vertex1  the first vertex
    * @param vertex2  the second vertex
    * @param weight   the weight 
    */
   public void addEdge (T vertex1, T vertex2, double weight);
   
   /** 
    * Returns the weight of the shortest path in this network. 
    *
    * @param vertex1  the first vertex
    * @param vertex2  the second vertex
    * @return         the weight of the shortest path in this network
    */
   public double shortestPathWeight(T vertex1, T vertex2);
}
